OpenCL Fast Fourier Transform
نویسنده
چکیده
Fast Fourier Transform is one of the most important numerical algorithms in history. It has wide range of applications: audio signal processing, medical imaging, image processing, pattern recognition, computational chemistry, error correcting codes and spectral methods for PDE’s. The goal of this project is to implement an OpenCL based FFT algorithm that has comparable performance with existing open source and vendor libraries.
منابع مشابه
Pathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)
This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds. The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...
متن کاملEfficient Dynamic Multiple GPGPU Layer for OpenCV
General purpose graphic processing unit (GPGPU) provides high performance resource for computing. CUDA (Compute Unified Device Architecture) and OpenCL (Open Computing Language) permit writing of parallel computing programs that utilize multiple central processing units (CPU) and GPGPUs. The image processing library, OpenCV (Open Source Computer Vision library), may benefit greatly from paralle...
متن کاملGPU Accelerated Real Time Rotation, Scale and Translation Invariant Image Registration Method
This paper presents highly optimized implementation of image registration method that is invariant to rotation scale and translation. Image registration method using FFT works with comparable accuracy as similar methods proposed in the literature, but practical applications seldom use this technique because of high computational requirement. However, this method is highly parallelizable and off...
متن کاملFast Fourier Transform Processors: Implementing FFT and IFFT Cores for OFDM Communication Systems
The terms Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) are used to denote efficient and fast algorithms to compute the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT) respectively. The FFT/IFFT is widely used in many digital signal processing applications and the efficient implementation of the FFT/IFFT is a topic of continuous research.
متن کاملOption pricing under the double stochastic volatility with double jump model
In this paper, we deal with the pricing of power options when the dynamics of the risky underling asset follows the double stochastic volatility with double jump model. We prove efficiency of our considered model by fast Fourier transform method, Monte Carlo simulation and numerical results using power call options i.e. Monte Carlo simulation and numerical results show that the fast Fourier tra...
متن کامل